Functionally recursive rings of matrices—Two examples
نویسندگان
چکیده
منابع مشابه
Functionally recursive rings of matrices-Two examples
We define the notions of finite-state and functionally recursive matrices and their growth. We also introduce two rings generated by functionally recursive matrices. The first is isomorphic to the 2-generated free ring. The second is a 2-generated monomial ring such that the multiplicative semigroup of monomials in the generators is nil of degree 5 and the ring has Gelfand Kirillov dimension 1 ...
متن کاملFunctionally recursive groups
This document describes the package FR, which implements in GAP the basic objects of Mealy machines and functional recursions; and handles groups that they generate. Groups defined by a recursive action on a rooted tree can be defined in GAP via their recursion. Various algorithms are implemented to manipulate these groups and their elements. For comments or questions on FR please contact the a...
متن کاملRecursive Ambiguity and Machina's Examples
Machina (2009, 2012) lists a number of situations where standard models of ambiguity aversion are unable to capture plausible features of ambiguity attitudes. Most of these problems arise in choice over prospects involving three or more outcomes. We show that the recursive non-expected utility model of Segal (1987) is rich enough to accommodate all these situations. JEL Classification number: D81
متن کاملMATH 436 Notes: Examples of Rings
i∈N R = {(a0, a1, a2, . . . )|aj ∈ R} is a countable direct product of (R,+) with itself. Thus the elements of R[[x]] are arbitrary sequences with entries in R where addition is componentwise. We define a multiplication ⋆ via (a0, a1, . . . ) ⋆ (b0, b1, . . . ) = (c0, c1, . . . ) where cn = ∑n k=0 akbn−k for all n ∈ N. It is easy to check that the sequence (1, 0, 0, . . . ) is a two-sided ident...
متن کاملLearning Recursive Automata from Positive Examples
In this theoretical paper, we compare the “classical” learning techniques used to infer regular grammars from positive examples with the ones used to infer categorial grammars. To this aim, we first study how to translate finite state automata into categorial grammars and back. We then show that the generalization operators employed in both domains can be compared, and that their result can alw...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2009
ISSN: 0021-8693
DOI: 10.1016/j.jalgebra.2009.09.021